A Learnable Representation for Syntax Using Residuated Lattices
نویسنده
چکیده
We propose a representation for natural language syntax based on the theory of residuated lattices: in particular on the Galois lattice between contexts and substrings, which we call the syntactic concept lattice. The natural representation derived from this is a richly structured context sensitive formalism that can be learned using a generalisation of distributional learning. In this paper we define the basic algebraic properties of the syntactic concept lattice, together with a representation derived from this lattice and discuss the generative power of the formalism. We establish some basic results which show that these representations, because they are defined language theoretically, can be inferred from information about the set of grammatical strings of the language. We also discuss the relation to other grammatical formalisms notably categorial grammar and context free grammars. We claim that this lattice based formalism is plausibly both learnable from evidence about the grammatical strings of a language and may be powerful enough to represent natural languages, and thus presents a potential solution to the central problem of theoretical linguistics.
منابع مشابه
Topological Residuated Lattices
In this paper, we study the separtion axioms $T_0,T_1,T_2$ and $T_{5/2}$ on topological and semitopological residuated lattices and we show that they are equivalent on topological residuated lattices. Then we prove that for every infinite cardinal number $alpha$, there exists at least one nontrivial Hausdorff topological residuated lattice of cardinality $alpha$. In the follows, we obtain some ...
متن کاملrepresentation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملRADICAL OF FILTERS IN RESIDUATED LATTICES
In this paper, the notion of the radical of a filter in residuated lattices is defined and several characterizations of the radical of a filter are given. We show that if F is a positive implicative filter (or obstinate filter), then Rad(F)=F. We proved the extension theorem for radical of filters in residuated lattices. Also, we study the radical of filters in linearly o...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کامل